/*Copyright (C) 2013-2021 LZE*/
#include<bits/stdc++.h>
#define INF 0x7fffffff
#define mod 1000000007
#define eps 1e-6
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int N=1000010;
ll n,a[N],b[N];
void MergeSort(ll l,ll r){
	if(l==r)return;
	ll mid=(l+r)/2;
	MergeSort(l,mid);
	MergeSort(mid+1,r);
	ll lp=l,rp=mid+1;
	for(ll p=l;p<=r;p++){
		if(lp<=mid&&a[lp]<=a[rp]){
			b[p]=a[lp++];
		}else if(rp<=r){
			b[p]=a[rp++];
		}else if(lp<=mid){
			b[p]=a[lp++];
		}else b[p]=a[rp++];
	}
	for(ll p=l;p<=r;p++)a[p]=b[p];
}
int main() {
	scanf("%lld",&n);
	for(ll i=1;i<=n;i++)scanf("%lld",&a[i]);
	MergeSort(1,n);
	for(ll i=1;i<=n;i++)printf("%lld ",b[i]);
	return 0;
}
